Inductive Logic Program Synthesis with DIALOGS

نویسنده

  • Pierre Flener
چکیده

DIALOGS (Dialog-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and minimally queries a (possibly computationally naive) specifier for evidence in her/his conceptual language. The specifier must know the answers to such simple queries, because otherwise s/he wouldn’t even feel the need for the synthesized program. DIALOGS can be used by any learner (including itself) that detects, or merely conjectures, the necessity of invention of a new predicate. Due to its foundation on a powerful codification of a “recursion-theory” (by means of the template and constraints of a divide-and-conquer schema), DIALOGS needs very little evidence and is very fast.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Synthesis of Recursive Programs – A Comparison of Three Systems

The paper we present compares the three systems for program synthesis, namely Adate, an approach through evolutionary computation, the inductive/abductive logic program synthesizer Dialogs-II and the classification learner Atre, capable of simultaneously learning mutually dependent, recursive target predicates. It gives an overview over the functionality of all three systems, and evaluates thei...

متن کامل

Inductive Programming: A Survey of Program Synthesis Techniques

Inductive programming—the use of inductive reasoning methods for programming, algorithm design, and software development—is a currently emerging research field. A major subfield is inductive program synthesis, the (semi-)automatic construction of programs from exemplary behavior. Inductive program synthesis is not a unified research field until today but scattered over several different establi...

متن کامل

Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects

The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in general) of logic programs from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis o...

متن کامل

Deductive and Inductive Synthesis of Equational Programs |Draft|

An equational approach to the synthesis of functional and logic program is taken. Typically, the synthesis task involves nding equations which make the given speci cation an inductive theorem. To synthesize such programs, induction is necessary. We formulate e cient procedures for inductive proof as well as program synthesis using the framework of ordered rewriting. We also propose heuristics f...

متن کامل

Inductive Program Synthesis as Induction of Context - Free Tree Grammars

We present an application of grammar induction in the domain of inductive program synthesis. Synthesis of recursive programs from input/output examples involves the solution of two subproblems: transforming examples into straightforward programs and folding straightforward programs into (a set of) recursive equations. In this paper we focus on the second part of the synthesis problem, which cor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996